Revising the Newman-Girvan Algorithm
نویسندگان
چکیده
Abstract: One of the common approaches for the community detection in complex networks is the Girvan-Newman algorithm [5] which is based on repeated deletion of edges having the maximum edge betweenness centrality. Although widely used, it may result in different dendrograms of hierarchies of communities if there are several edges eligible for removal (see [6]) thus leaving an ambiguous formation of network subgroups. We will present possible ways to overcome these issues using, instead of edge betweenness computation for single edges, the group edge betweenness for subsets of edges to be subjects of removal.
منابع مشابه
Fuzzy Graph Clustering based on Non-Euclidean Relational Fuzzy c-Means
Graph clustering is a very popular research field with numerous practical applications. Here we focus on finding fuzzy clusters of nodes in unweighted, undirected, and irreflexive graphs. We introduce three new algorithms for fuzzy graph clustering (Newman–Girvan NERFCM, Small World NERFCM, Signal NERFCM). Each of these three new algorithms uses a popular algorithm for crisp graph clustering an...
متن کاملDeterministic graph-theoretic algorithm for detecting modules in biological interaction networks
An approach for module identification, Modules of Networks (MoNet), introduced an intuitive module definition and clear detection method using edges ranked by the Girvan-Newman algorithm. Modules from a yeast network showed significant association with biological processes, indicating the method's utility; however, systematic bias leads to varied results across trials. MoNet modules also exclud...
متن کاملDetecting Communities from Social Tagging Networks Based on Tripartite Modularity
Online social media such as delicious and digg are represented as tripartite networks whose vertices are users, tags, and resources. Detecting communities from such tripartite networks is practically important. Newman-Girvan modularity is often used as the criteria for evaluating the goodness of network divisions into communities. Murata has extended Newman-Girvan modularity in order to evaluat...
متن کاملIndirect Influences, Links Ranking, and Deconstruction of Networks
The PWP map was introduced by the second author as a tool for ranking nodes in networks. In this work we extend this technique so that it can be used to rank links as well. Applying the Girvan-Newman algorithm a ranking method on links induces a deconstruction method for networks, therefore we obtain new methods for finding clustering and core-periphery structures on networks.
متن کاملSe p 20 07 Motif - based communities in complex networks
Community definitions usually focus on edges, inside and between the communities. However, the high density of edges within a community determines correlations between nodes going beyond nearest-neighbours, and which are indicated by the presence of motifs. We show how motifs can be used to define general classes of nodes, including communities, by extending the mathematical expression of Newma...
متن کامل